Decomposition of K m,n into 4-cycles and 2t-cycles
نویسندگان
چکیده
منابع مشابه
Decomposition of Circulants into Antidirected Hamilton Cycles
Let G = Gn(a1, a2, ..., ak) denote a directed circulant graph of order n with k pairwise distinct jumps [1]. Antidirected Hamilton cycle in G is a cycle of n arcs that does not contain induced directed path P2. Let C 1 G, C 2 G, ..., C k G be pairwise arc-disjoint antidirected Hamilton cycles in G, each composed of exactly two distinct jumps. We give the necessary and sufficient conditions for ...
متن کاملDecomposition of complete bipartite multigraphs into paths and cycles having k edges
We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph Km,n(λ) into paths and cycles having k edges. In particular, we show that such decomposition exists in Km,n(λ), when λ ≡ 0 (mod 2), m, n ≥ k2 , m + n > k, and k(p + q) = 2mn for k ≡ 0(mod 2) and also when λ ≥ 3, λm ≡ λn ≡ 0(mod 2), k(p + q) = λmn, m, n ≥ k, (resp., m,n ≥ 3k/2) for k ≡ 0(mod 4) (re...
متن کاملDecomposition of complete multigraphs into stars and cycles
Let k be a positive integer, Sk and Ck denote, respectively, a star and a cycle of k edges. λKn is the usual notation for the complete multigraph on n vertices and in which every edge is taken λ times. In this paper, we investigate necessary and sufficient conditions for the existence of the decomposition of λKn into edges disjoint of stars Sk’s and cycles Ck’s.
متن کاملClustering Cycles into Cycles of Clusters
In this paper we study simple families of clustered graphs that are highly non connected. We start by studying 3-cluster cycles, that are clustered graphs such that the underlying graph is a simple cycle and there are three clusters all at the same level. We show that in this case testing the c-planarity can be done efficiently and give an efficient drawing algorithm. Also, we characterize 3-cl...
متن کاملDecomposing Dense Bipartite Graphs into 4-Cycles
Let G be an even bipartite graph with partite sets X and Y such that |Y | is even and the minimum degree of a vertex in Y is at least 95|X|/96. Suppose furthermore that the number of edges in G is divisible by 4. Then G decomposes into 4-cycles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2007
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-007-9060-x